package p2000;

import java.util.Scanner;

public class Main2028多个数的最小公倍数 {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNextInt()) {
            int t = scanner.nextInt();
            int[] arr = new int[t];
            int min = 0, max = 0;
            int result = 0;
            for (int i = 0; i < t; i++) {
                int a = scanner.nextInt();

                arr[i] = a;
                if (max < a) {
                    max = a;
                }
                if (min == 0 || min > a) {
                    min = a;
                }
            }

            boolean aa = false;
            for (int i = min; i < max; i += min) {
                result = i;
                boolean flag = true;
                for (int k : arr) {
                    if (k != min && i % k != 0) {
                        flag = false;
                        break;
                    }
                }

                if (flag) {
                    aa = true;
                    break;
                }
            }

            if (aa) {
                System.out.println(result);
            } else {
                for (int i = max; ; i += max) {
                    boolean flag = true;
                    result = i;
                    for (int k : arr) {
                        if (k != max && i % k != 0) {
                            flag = false;
                            break;
                        }
                    }

                    if (flag) {
                        break;
                    }
                }
                System.out.println(result);
            }
        }
    }

}
